Conservative Visibility Determination for Architectural Scenes

نویسنده

  • Boris Reuderink
چکیده

In this article I present a conservative visibility determination algorithm, particularly suited for interactive walkthroughs in architectural scenes. This algorithm is able to determine which parts of the scene are visible during an interactive real-time walkthrough. The algorithm consists of an off-line part, which preprocesses the scene, and an on-line part, which determines the potentially visible faces for a given viewpoint. The algorithm uses a heuristic, which tries to maximize the number of found occluders, to guide the spatial subdivision. The faces of the cells that intersect the scene after the subdivision are used as occluders. During the interactive walkthrough, the nodes of the scene are recursively tested against a buffer that stores the occluders of drawn cells.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Conservative From-Point Visibility

Visibility determination has been an important part of the computer graphics research for several decades. First studies of the visibility were hidden line removal algorithms, and later hidden surface removal algorithms. Today’s visibility determination is mainly concentrated on conservative, object level visibility determination techniques. Conservative methods are used to accelerate the rende...

متن کامل

Occlusion Culling in Terrains based on automatically generated virtual Occluders

In this paper we present a computationally inexpensive way to perform Occlusion Culling in terrain scenes, modelled by elevation maps. The proposed method is based on virtual Occluders [Law99] (i.e. relatively simple structures, that are used to perform the actual visibility test). Unlike most of the related work, we did not seek for an accurate solution, but for a good conservative and inexpen...

متن کامل

A Survey of Visibility for Walkthrough Applications

Visibility algorithms for walkthrough and related applications have grown into a significant area, spurred by the growth in the complexity of models and the need for highly interactive ways of navigating them. In this survey we review the fundamental issues in visibility and conduct an overview of the visibility culling techniques developed in the last decade. The taxonomy we use makes the dist...

متن کامل

Ray Space Factorization for From-Region Visibility

We present a fast conservative from-region visibility method capable of handling 3D models using arbitrary 3D triangles as occluders. The from-region visibility problem is considered significantly harder than the from-point visibility problem, since it is inherently 4-dimensional. Our occlusion culling method is based on factorizing the 4D visibility problem into horizontal and vertical compone...

متن کامل

Conservative Visibility and Strong Occlusion for Viewspace Partitioning of Densely Occluded Scenes

Computing the visibility of out-door scenes is often much harder than of in-door scenes. A typical urban scene, for example, is densely occluded, and it is effective to precompute its visibility space, since from a given point only a small fraction of the scene is visible. The difficulty is that although the majority of objects are hidden, some parts might be visible at a distance in an arbitra...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2005